The maximum size of L-functions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Maximum Size of L-functions

A fundamental problem in analytic number theory is to calculate the maximum size of Lfunctions in the critical strip. For example, the importance of the Lindelöf Hypothesis, which is a consequence of the Riemann Hypothesis, is that it provides at least a crude estimate for the maximum in the case of the Riemann zeta-function. In this paper we use a variety of methods to conjecture the true rate...

متن کامل

On the maximum size of a (k, l)-sum-free subset of an abelian group

A subset A of a given finite abelian group G is called (k, l)-sum-free if the sum of k (not necessarily distinct) elements of A does not equal the sum of l (not necessarily distinct) elements of A. We are interested in finding the maximum size λk,l(G) of a (k, l)-sum-free subset in G. A (2, 1)-sum-free set is simply called a sum-free set. The maximum size of a sum-free set in the cyclic group Z...

متن کامل

Stability of the Maximum Size Matching

Among scheduling algorithms used in input queued switches, it is known that the Maximum Size Matching (MSM) algorithm maximizes the instantaneous throughput. Although there have been results on the stability of some specific types of MSMs for scheduling traffic [5], the question of how it performs under uniform traffic remains open. Simulations suggest the stability of MSM algorithms under unif...

متن کامل

The Maximum Size of Dynamic Data Structures

This paper develops two probabilistic methods that allow the analysis of the maximum data structure size encountered during a sequence of insertions and deletions in data structures such as priority queues, dictionaries, linear lists, and symbol tables, and in sweepline structures for geometry and Very-LargeScale-Integration (VLSI) applications. The notion of the "maximum" is basic to issues of...

متن کامل

On the Pointwise Maximum of Convex Functions

We study the conjugate of the maximum, f ∨ g, of f and g when f and g are proper convex lower semicontinuous functions on a Banach space E. We show that (f ∨g)∗∗ = f∗∗ ∨g∗∗ on the bidual, E∗∗, of E provided that f and g satisfy the Attouch-Brézis constraint qualification, and we also derive formulae for (f ∨ g)∗ and for the “preconjugate” of f∗ ∨ g∗.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal für die reine und angewandte Mathematik (Crelles Journal)

سال: 2007

ISSN: 0075-4102,1435-5345

DOI: 10.1515/crelle.2007.064